The Class of Series - Parallel Graphs . Part II 1 Krzysztof Retel University of Białystok
نویسنده
چکیده
In this paper we introduce two new operations on graphs: sum and union corresponding to parallel and series operation respectively. We determine N-free graph as the graph that does not embed Necklace 4. We define “fin RelStr” as the set of all graphs with finite carriers. We also define the smallest class of graphs which contains the one-element graph and which is closed under parallel and series operations. The goal of the article is to prove the theorem that the class of finite series-parallel graphs is the class of finite N-free graphs. This paper formalizes the next part of [12].
منابع مشابه
The Class of Series-Parallel Graphs. Part II
In this paper we introduce two new operations on graphs: sum and union corresponding to parallel and series operation respectively. We determine N -free graph as the graph that does not embed Necklace 4. We define “fin RelStr” as the set of all graphs with finite carriers. We also define the smallest class of graphs which contains the one-element graph and which is closed under parallel and ser...
متن کاملThe Class of Series-Parallel Graphs. Part III
In this paper A, B, a, b, c, d, e, f , g, h denote sets. One can prove the following three propositions: (1) idA↾B = idA ∩ [:B, B :]. (2) id{a,b,c,d} = {〈a, a〉, 〈b, b〉, 〈c, c〉, 〈d, d〉}. (3) [: {a, b, c, d}, {e, f, g, h} :] = {〈a, e〉, 〈a, f〉, 〈b, e〉, 〈b, f〉, 〈a, g〉, 〈a, h〉, 〈b, g〉, 〈b, h〉} ∪ {〈c, e〉, 〈c, f〉, 〈d, e〉, 〈d, f〉, 〈c, g〉, 〈c, h〉, 〈d, g〉, 〈d, h〉}. Let X, Y be trivial sets. Observe that ...
متن کاملThe Class of Series – Parallel Graphs. Part I
We adopt the following rules: n is a natural number and x1, x2, x3, x4, x5, y1, y2, y3 are sets. Let x1, x2, x3, x4, x5 be sets. We say that x1, x2, x3, x4, x5 are mutually different if and only if: (Def. 1) x1 6= x2 and x1 6= x3 and x1 6= x4 and x1 6= x5 and x2 6= x3 and x2 6= x4 and x2 6= x5 and x3 6= x4 and x3 6= x5 and x4 6= x5. Next we state several propositions: (1) If x1, x2, x3, x4, x5 ...
متن کاملDeveloping a bi-objective optimization model for solving the availability allocation problem in repairable series–parallel systems by NSGA II
Bi-objective optimization of the availability allocation problem in a series–parallel system with repairable components is aimed in this paper. The two objectives of the problem are the availability of the system and the total cost of the system. Regarding the previous studies in series–parallel systems, the main contribution of this study is to expand the redundancy allocation problems to syst...
متن کاملA special Class of Stochastic PERT Networks
Considering the network structure is one of the new approaches in studying stochastic PERT networks (SPN). In this paper, planar networks are studied as a special class of networks. Two structural reducible mechanisms titled arc contraction and deletion are developed to convert any planar network to a series-parallel network structure. In series-parallel SPN, the completion time distribution f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004